/*
 * Copyright (c) 2005-2011 Apple Inc. All rights reserved.
 *
 * @APPLE_LICENSE_HEADER_START@
 * 
 * This file contains Original Code and/or Modifications of Original Code
 * as defined in and that are subject to the Apple Public Source License
 * Version 2.0 (the 'License'). You may not use this file except in
 * compliance with the License. Please obtain a copy of the License at
 * http://www.opensource.apple.com/apsl/ and read it before using this
 * file.
 * 
 * The Original Code and all software distributed under the License are
 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
 * Please see the License for the specific language governing rights and
 * limitations under the License.
 * 
 * @APPLE_LICENSE_HEADER_END@
 */

#include <stdlib.h>
#include <stdint.h>
#include <string.h>
#include <stdbool.h>
#include <mach-o/dyld-interposing.h>
#include <malloc/malloc.h>

static void* seenAllocations[128];
static int seenAllocationIndex = 0;

// record each malloc result in a ring buffer
void* my_malloc(size_t size)
{
	char* x = malloc(size);
	seenAllocations[seenAllocationIndex++] = x;
	seenAllocationIndex = (seenAllocationIndex & 127); //wrap around
	return x;
}

DYLD_INTERPOSE(my_malloc, malloc)

bool allocationSeen(void* p)
{
	for(int i=0; i < 127; ++i) {
		if ( seenAllocations[i] == p )
			return true;
	}
	return false;
}



